#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[10005],f[10005];
int v;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    for (int i=1;i<=n;i++)
    {
        if (a[i]!=a[i-1])
        {
            f[++v]++;
        }
        else
        {
            f[v]++;
        }
    }
    for (int i=1;i<=v;i++)
    {
        f[i+1]+=abs(f[i+1]-f[i]);
    }
    cout<<f[v];
    return 0;
}
